Hybridizing Nested Dissection and
نویسندگان
چکیده
Minimum degree and nested dissection are the two most popular reordering schemes used to reduce ll-in and operation count when factoring and solving sparse matrices. Most of the state-of-the-art ordering packages hybridize these methods by performing incomplete nested dissection and ordering by minimum degree the subgraphs associated with the leaves of the separation tree, but most often only loose couplings have been achieved, resulting in poorer performance than could have been expected. This paper presents a tight coupling of the nested dis-section and halo approximate minimum degree algorithms, which allows the minimum degree algorithm to use exact degrees on the boundaries of the subgraphs passed to it, and to yield back not only the ordering of the nodes of the subgraph, but also the amalgamated assembly subtrees, for eecient block computations. Experimental results show the performance improvement of this hy-bridization, both in terms of ll-in reduction and increase of concurrency on a parallel sparse block symmetric solver.
منابع مشابه
Hybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix Ordering
Minimum Degree and Nested Dissection are the two most popular reordering schemes used to reduce ll-in and operation count when factoring and solving sparse matrices. Most of the state-of-the-art ordering packages hybridize these methods by performing incomplete Nested Dissection and ordering by Minimum Degree the subgraphs associated with the leaves of the separation tree, but to date only loos...
متن کاملTradeoos between Parallelism and Fill in Nested Dissection
In this paper we demonstrate that tradeoos can be made between parallelism and ll in nested dissection algorithms for Gaussian elimination, both in theory and in practice. We present a new \less parallel nested dissection" algorithm (LPND), and prove that, unlike the standard nested dissection algorithm, when applied to a chordal graph LPND nds a zero-ll elimination order. We have also implemen...
متن کاملNumerical Stability of Nested Dissection Orderings By Indu
Rigorous bounds on rounding errors for sparse positive definite matrices are obtained. When used for nested dissection orderings of finite element matrices, the analysis furnishes bounds which are stronger than those for band orderings.
متن کاملNumerical Stability of Nested Dissection Orderings
Rigorous bounds on rounding errors for sparse positive definite matrices are obtained. When used for nested dissection orderings of finite element matrices, the analysis furnishes bounds which are stronger than those for band orderings.
متن کاملImplementation of Nested Dissection Method Using Block Elimination
In this paper, we consider the problem of solving an 2 2 n n sparse positive definite system b AU , arising from the use of finite difference methods to solve an elliptic boundary value problem on an n n mesh where 1 2 k n where k is a positive integer. The large sparse linear system can be solved directly in an efficient way using nested dissection method, originally proposed by Alan...
متن کامل